An ERP Study of the Object Preference in Processing Chinese Relative Clauses

Through an event-related potential (ERP) study, we examined the processing mechanisms of four types of Chinese (Mandarin) relative clauses (RCs), namely subject subject-extracted relative clause (SSR), subject object-extracted relative clause (SOR), object subject-extracted relative clause (OSR), and object object-extracted relative clause (OOR) to test the universality and language specificity of RC comprehension processes. The results of this study support a preference for object-extracted RCs modifying both the subject and object of a sentence, i.e., SORs and OORs. In particular, ERP results showed stronger P600 effects in the RC region for SSRs compared with SORs, which we argue reflects a canonical word order theory. Stronger N400 effects were observed for verbs compared with nouns, reflecting easier understanding for nouns. ERP results from the matrix clause object and the relativizer de showed stronger P600 effects in SSRs compared with SORs, suggesting thematic structure effects on syntactic construction and the processing preference of the whole sentence.     

Extension and equivalence problems for clause minimal formulae

Inspired by the notion of minimal unsatisfiable formulae we first introduce and study the class of clause minimal formulae. A CNF formula F is said to be clause minimal if any proper subformula of F is not equivalent to F. We investigate the equivalence and extension problems for clause minimal formulae. The extension problem is the question whether for two formulae F and H there is some formula G such that F+G is equivalent to H. Generally, we show that these problems are intractable. Then we discuss the complexity of these problems restricted by various parameters and constraints. In the last section we ask several open questions in this area.     

英汉翻译中定语、定语从句转译为状语的修辞手法

英汉翻译中，经常用定语、定语从句转译为状语的修辞手法。其中，前置定语具有状语意义，修饰抽象名词、普通名词，行为或带有某种特性的人等。有些定语从句形式上虽然是定语，但在作用和意义上则是状语，可表示原因、让步、目的、条件以及时间等等。     

although、though和as引导的让步状语从句探讨

让步状语从句表示某种不利的情况或相反的条件,但这些因素并不能阻止主句动作的发生。Although、though和as都可以引导让步状语从句,但是,从它的向式结构不同着眼,有可以把它分为若干种表达形式。这对丰富英汉互译的表达手段更为有益。     

Algorithmic Debugging and Hypothetical Reasoning

This paper presents a generalization of Shapiro style algorithmic debugging for generalized Horn clause intuitionistic logic. This logic offers hypothetical reasoning and negation is defined not by failure but by inconsistency. We extend Shapiro's notion of intended interpretation, symptoms and errors and give formal results paralleling those known for definite clauses. We also show how a corresponding diagnosis module for RISC- a logic programming system for generalized Horn clause intuitionistic logic-can be defined by meta interpretation. In contrast to Shapiro's PROLOG modules ours work independently of the specific computation rule that in RISC may be specified by the user.     

Translation among CNFs, characteristic models and ordered binary decision diagrams

We consider translation among conjunctive normal forms (CNFs), characteristic models, and ordered binary decision diagrams (OBDDs) of Boolean functions. It is shown in this paper that Horn OBDDs can be translated into their Horn CNFs in polynomial time. As for the opposite direction, the problem can be solved in polynomial time if the ordering of variables in the resulting OBDD is specified as an input. In case that such ordering is not specified and the resulting OBDD must be of minimum size, its decision version becomes NP-complete. Similar results are also obtained for the translation in both directions between characteristic models and OBDDs. We emphasize here that the above results hold on any class of functions having a basis of polynomial size.     

A music notation construction engine for optical music recognition

Optical music recognition (OMR) systems are used to convert music scanned from paper into a format suitable for playing or editing on a computer. These systems generally have two phases: recognizing the graphical symbols (such as note‐heads and lines) and determining the musical meaning and relationships of the symbols (such as the pitch and rhythm of the notes). In this paper we explore the second phase and give a two‐step approach that admits an economical representation of the parsing rules for the system. The approach is flexible and allows the system to be extended to new notations with little effort—the current system can parse common music notation, Sacred Harp notation and plainsong. It is based on a string grammar and a customizable graph that specifies relationships between musical objects. We observe that this graph can be related to printing as well as recognizing music notation, bringing the opportunity for cross‐fertilization between the two areas of research. Copyright © 2003 John Wiley & Sons, Ltd.     

Extension and equivalence problems for clause minimal formulae

Inspired by the notion of minimal unsatisfiable formulae we first introduce and study the class of clause minimal formulae. A CNF formula F is said to be clause minimal if any proper subformula of F is not equivalent to F. We investigate the equivalence and extension problems for clause minimal formulae. The extension problem is the question whether for two formulae F and H there is some formula G such that F + G is equivalent to H. Generally, we show that these problems are intractable. Then we discuss the complexity of these problems restricted by various parameters and constraints. In the last section we ask several open questions in this area.     

基于支持集策略实现定理证明及问题的求解

人工智能原理中，基于一阶谓词逻辑下的归结推理方法可以在机器上实现“自动定理证明以及问题的求解”，实际研究应用表明归结原理中的“支持集策略”是一种简单、高效、完备的实现定理证明和问题求解的好方法。     

基于WAM的Prolog推理引擎的实现

提出了在实现基于WAM(Warrens Abstract Machine)架构的C-Prolog推理引擎过程中所遇到的问题，以及相应的解决方法和策略。在实现过程中，严格遵循了WAM体系架构中所提出的指令规范。为了提高系统运行时的效率，在指令预处理方面做了大量的工作，利用回填技术生成更快速的WAM代码。而其实现语言C使得该系统易于维护和改善，并与外部的应用程序的接口更方便灵活。